On Multigraph Extremal Problems
نویسنده
چکیده
1 . Introduction . In this paper we shall consider multigraphs and digraphs (= directed graphs) with bounded multiplicity : an integer r is fixed and we shall assume, that the considered multigraphs or digraphs have no loops, further, if u and v are two vertices of a multigraph M, they can be joined by more than one edge, however, they cannot be joined by more than r edges. In case of digraphs u and v cannot be joined by more than r edges of the same orientation .
منابع مشابه
On Extremal Multiflows
Given an Eulerian multigraph, a subset T of its vertices, and a collection H of subsets of T, we ask how few edge-disjoint paths can contain maximum (A, T"A)flows, for all A # H at once. We answer the question for a certain class of hypergraphs H by presenting a strongly polynomial construction of a minimum set of such paths and a min-max formula for its cardinality. The method consists in redu...
متن کاملExtremal theory of locally sparse multigraphs
An (n, s, q)-graph is an n-vertex multigraph where every set of s vertices spans at most q edges. In this paper, we determine the maximum product of the edge multiplicities in (n, s, q)graphs if the congruence class of q modulo (
متن کاملMulticolour Turán problems
A simple k-colouring of a multigraph G is a decomposition of the edge multiset as the sum of k simple graphs, called ‘colours’. A copy of some fixed graph H in G is called multicoloured if its edges all have distinct colours. Recall that the Turán number ex(n,H) of H is the maximum number of edges in a graph on n vertices not containing a copy of H . We consider a multicolour generalisation exk...
متن کاملAn extremal graph problem with a transcendental solution
We prove that the number of multigraphs with vertex set {1, . . . , n} such that every four vertices span at most nine edges is a +o(n) where a is transcendental (assuming Schanuel’s conjecture from number theory). This is an easy consequence of the solution to a related problem about maximizing the product of the edge multiplicities in certain multigraphs, and appears to be the first explicit ...
متن کاملMaximum k-intersection, edge labeled multigraph max capacity k-path, and max factor k-gcd are all NP-hard
Proofs of NP-hardness of the maximum k-intersection, edge labeled multigraph max capacity k-path, and max factor k-gcd problems are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004